Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Image double blind denoising algorithm combining with denoising convolutional neural network and conditional generative adversarial net
JING Beibei, GUO Jia, WANG Liqing, CHEN Jing, DING Hongwei
Journal of Computer Applications    2021, 41 (6): 1767-1774.   DOI: 10.11772/j.issn.1001-9081.2020091355
Abstract282)      PDF (1447KB)(493)       Save
In order to solve the problems of poor denoising effect and low computational efficiency in image denoising, a double blind denoising algorithm based on Denoising Convolutional Neural Network (DnCNN) and Conditional Generative Adversarial Net (CGAN) was proposed. Firstly, the improved DnCNN model was used as the CGAN generator to capture the noise distribution of the noisy image. Secondly, the noisy image after eliminating the noise distribution and the tag were sent to the discriminator to distinguish the noise reduction image. Thirdly, the results of discrimination were used to optimize the hidden layer parameters of the whole model. Finally, a balance between the generator and the discriminator was achieved in the game, and the generator's residual capture ability was optimal. Experimental results show that on Set12 dataset, when the noise levels are 15, 25, 50 respectively:compared with the DnCNN algorithm, the proposed algorithm has the Peak Signal-to-Noise Ratio (PSNR) increased by 1.388 dB, 1.725 dB and 1.639 dB respectively based on the error evaluation index between pixel points. Compared with the existing algorithms such as Block Matching 3D (BM3D), Weighted Nuclear Norm Minimization (WNNM), DnCNN, Cascade of Shrinkage Fields (CSF) and ConSensus neural NETwork (CSNET), the proposed algorithm has the index value of Structural SIMilarity (SSIM) improved by 0.000 2 to 0.104 1 on average based on the evaluation index of structural similarity. The above experimental results verify the superiority of the proposed algorithm.
Reference | Related Articles | Metrics
Analysis of three-time-slot P-persistent CSMA protocol with variable collision duration in wireless sensor network
LI Mingliang, DING Hongwei, LI Bo, WANG Liqing, BAO Liyong
Journal of Computer Applications    2020, 40 (7): 2038-2045.   DOI: 10.11772/j.issn.1001-9081.2019112028
Abstract298)      PDF (4238KB)(243)       Save
Random multiple access communication is an indispensable part of computer communication research. A three-slot P-Persistent Carrier Sense Multiple Access (P-CSMA) protocol with variable collision duration in Wireless Sensor Network (WSN) was proposed to solve the problem of traditional P-CSMA protocol in transmitting and controlling WSN and energy consumption of system. In this protocol, the collision duration was added to the traditional two-time-slot P-CSMA protocol in order to change the system model to three-time-slot model, that is, the duration of information packet being sent successfully, the duration of packet collision and the idle duration of the system.Through the modeling, the throughput, collision rate and idle rate of the system under this model were analyzed. It was found that by changing the collision duration, the loss of the system was reduced. Compared with the traditional P-CSMA protocol, this protocol makes the system performance improved, and makes the lifetime of the system nodes obtained based on the battery model obviously extended. Through the analysis, the system simulation flowchart of this protocol is obtained. Finally, by comparing and analyzing the theoretical values and simulation values of different indexes, the correctness of the theoretical derivation is proved.
Reference | Related Articles | Metrics